Randomization Time for the Overhand Shuffle

نویسنده

  • Robin Pemantle
چکیده

1. THE OVERHAND SHUFFLE (~o The two most common methods of shuffling a deck of playing cards are the riffle shuffle and the overhand shuffle. The riffle shuffle is performed by splitting the deck into two halves and interlacing them. Aldous and Diaconis have shown in Ref. I that approximately 2 log N riffle shuffles suffices to randomize a deck (the meaning of this will be made more precise below). In particular, about 7 riffle shuffles are sufficient to randomize a 52-card deck. This paper shows that the overhand shuffle takes order of N 2 or more shuffles to randomize a 52-card deck, explaining why it is only the second most popular shuffle. To perform an overhand shuffle, hold the deck of cards in your right hand and slide a small packet of cards off the top of the deck into your left hand. Repeat this process, putting each successive packet on top of the previous one, until all the cards are in your left hand, so the order of the cards gets reversed in clumps. The overhand shuffle is frequently used by casual card players. It

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Overhand Shuffle Mixes in Θ ( N 2 Log N ) Steps

The overhand shuffle is one of the “real” card shuffling methods in the sense that some people actually use it to mix a deck of cards. A mathematical model was constructed and analyzed by Pemantle [J. Theoret. Probab. 2 (1989) 37–49] who showed that the mixing time with respect to variation distance is at least of order n and at most of order n logn. In this paper we use an extension of a lemma...

متن کامل

The overhand shuffle mixes in Θ(n log n) steps

The overhand shuffle is one of the “real” card shuffling methods in the sense that some people actually use it to mix a deck of cards. A mathematical model was constructed and analyzed by Pemantle [5] who showed that the mixing time with respect to variation distance is at least of order n2 and at most of order n2 log n. In this paper we use an extension of a lemma of Wilson [7] to establish a ...

متن کامل

The overhand shuffle mixes in Θ ( n 2 log n ) steps Johan

The overhand shuffle is one of the “real” card shuffling methods in the sense that some people actually use it to mix a deck of cards. A mathematical model was constructed and analyzed by Pemantle [4] who showed that the mixing time with respect to variation distance is at least of order n2 and at most of order n2 log n. In this paper we use an extension of a lemma of Wilson [6] to establish a ...

متن کامل

Soluble Expression and Purification of Q59L Mutant L-asparaginase in the Presence of Chaperones in SHuffle™ T7 strain

Background and Aims: Q59L mutant of L-asparaginase enzyme from Escherichia coli (E. coli) has been introduced with lower side effects. This version of the enzyme might have potential applications in the treatment of leukemia patients. We utilized SHuffle T7 strain of E. coli, to produce the mutant enzyme in the presence of chaperone molecules. Materials and Methods: Q59LAsp gene was cloned in...

متن کامل

A randomization-based perspective of analysis of variance: a test statistic robust to treatment effect heterogeneity

Fisher randomization tests for Neyman’s null hypothesis of no average treatment effects are considered in a finite population setting associated with completely randomized experiments with more than two treatments. The consequences of using the F statistic to conduct such a test are examined both theoretically and computationally, and it is argued that under treatment effect heterogeneity, use ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003